A specious unlinking strategy
نویسندگان
چکیده
We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components. The unlinking number u(L) of a link L in S is the minimal number of crossing changes required to turn a diagram of L into a diagram of the unlink. Here we take the minimum over all diagrams of L. Similarly, the splitting number sp(L) is the minimal number of crossing changes required to turn a diagram of L into a diagram of a split link. Once again the minimum is taken over all diagrams of L. Here recall that an m-component link L is split if there are m disjoint balls in S, each of which contains a component of L. The detailed study of unlinking numbers and splitting numbers of links was initiated by Kohn [Ko91, Ko93] in the early 1990s, and was continued by several other researchers, see e.g. [Ad96, Ka96, Sh12, BS13, Ka13, CFP13]. See also [BW84, Tr88] for some early work. Somewhat to our surprise, these are still relatively unstudied topics, and many basic questions remain unanswered. In our investigations we wondered whether the computation of unlinking numbers can be separated into the two problems of splitting links and unknotting of knots. More precisely, the following question arose. Question 1. Is the following always the most efficient strategy for unlinking? First split the link with the minimal number of crossing changes, and then unknot the resulting knots. In this short note we will give a negative answer to the above question. More precisely, we have the following theorem. Theorem 2. The link L in Figure 1 has the property that any sequence of crossing changes for which the initial sp(L) crossing changes turn L into a split link S, and where the remaining crossing changes unknot the components of S, has length greater than u(L). The remainder of this note comprises the demonstration of this theorem. First we 2010 Mathematics Subject Classification. 57M25, 57M27.
منابع مشابه
Unlinking Number and Unlinking Gap
After introducing the Bernhard-Jablan Conjecture, we computed rational links with an unlinking gap for n ≤ 16 crossings. Several new infinite multi-parameter families of rational knots and links with unlinking gap are described. The general principle for the construction of infinite families of links with an unlinking gap is proposed. New infinite families of polyhedral alternating links with u...
متن کاملFtsK-dependent XerCD-dif recombination unlinks replication catenanes in a stepwise manner.
In Escherichia coli, complete unlinking of newly replicated sister chromosomes is required to ensure their proper segregation at cell division. Whereas replication links are removed primarily by topoisomerase IV, XerC/XerD-dif site-specific recombination can mediate sister chromosome unlinking in Topoisomerase IV-deficient cells. This reaction is activated at the division septum by the DNA tran...
متن کاملCombining Left and Right Unlinking for Matching a Large Number of Learned Rules
In systems which learn a large number of rules (productions), it is important to match the rules e ciently, in order to avoid the machine learning utility problem | if the learned rules slow down the matcher, the \learning" can slow the whole system down to a crawl. So we need match algorithms that scale well with the number of productions in the system. (Doorenbos, 1993) introduced right unlin...
متن کاملEffects of magnetic fields on the seed germination and metabolism in two specious of Almond
During the past decade considerable evidence has been accumulated with regard to the biological effects, both in vivo and in vitro, of extremely low frequency electric and magnetic fields, such as those originating from residentially proximate power lines, household electrical wiring and diagnostic apparatus and therapy devices. Also, during the evolution process, all living organisms experienc...
متن کاملSpecious rules: an efficient and effective unifying method for removing misleading and uninformative patterns in association rule mining
We present theoretical analysis and a suite of tests and procedures for addressing a broad class of redundant and misleading association rules we call specious rules. Specious dependencies, also known as spurious, apparent, or illusory associations, refer to a well-known phenomenon where marginal dependencies are merely products of interactions with other variables and disappear when conditione...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Periodica Mathematica Hungarica
دوره 69 شماره
صفحات -
تاریخ انتشار 2014